Resolving Connicting Arguments under Uncertainties

نویسنده

  • Henry Prakken
چکیده

Distributed knowledge based applications in open domain rely on common sense information which is bound to be uncertain and incomplete. To draw the useful conclusions from ambiguous data, one must address uncertainties and connicts incurred in a holis-tic view. No integrated frameworks are viable without an in-depth analysis of con-icts incurred by uncertainties. In this paper , we give such an analysis and based on the result, propose an integrated framework. Our framework extends deenite argumenta-tion theory to model uncertainty. It supports three views over connicting and uncertain knowledge. Thus, knowledge engineers can draw diierent conclusions depending on the application context (i.e. view). We also give an illustrative example on strategical decision support to show the practical usefulness of our framework.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Arguments as Background Knowledge for the Justiication of Case-based Inferences

This paper examines the representation of background knowledge and its use in case-based reasoning. Case-based reasoning can be viewed as a particular form of problem-solving, based on the assessment of similarity of a new case to previously encountered cases, and the subsequent inference that an old solution also applies to the new case. To justify such inferences, we present a representation ...

متن کامل

Resolving Conflicting Arguments under Uncertainties

Distributed knowledge based applications in open domain rely on common sense infor­ mation which is bound to be uncertain and incomplete. To draw the useful conclusions from ambiguous data, one must address un­ certainties and conflicts incurred in a holis­ tic view. No integrated frameworks are vi­ able without an in-depth analysis of con­ flicts incurred by uncertainties. In this pa­ per, we ...

متن کامل

Representing Arguments as Background Knowledge for Constraining Generalisation

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

متن کامل

Noncooperative Connict Resolution

Air Traac Management Systems (ATMS) of the future allow for the possibility of Free Flight, in which aircraft choose their own optimal routes, altitude and speed. In a free ight environment, the trajectories of diierent aircraft may be connicting, in which case aircraft may or may not cooperate in resolving the connict. In this paper, noncooperative connict resolution methods based on game theo...

متن کامل

Representing Arguments as Background Knowledge for Constraining Gereralisation

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998